搜索资源列表
Binary-tree-creation-and-traversal
- 二叉树的创建与遍历建立二叉树左右链存储结构。 对其递归的实现中序，先序，后序遍历。 对其非递归的实现中序，先序，后序遍历。 -Binary tree creation and traversal binary tree set up chain stores around the structure. Recursive implementation of its order, the first order, the order of traversal. Non-recursiv
binary-tree
- 1、参考P66建立二叉树的算法，建立图4-13（a）所示二叉树； 2、实现对该二叉树的先、中、后序遍历并输出遍历序列； 3、实现该二叉树的中序遍历非递归算法； 4、实现对该二叉树交换其左右子女的算法。 -1, reference P66 build binary tree algorithm, the establishment of Figure 4-13 (a) shows the binary tree 2, to achieve the binary
Using-binary-tree
- 数据结构课程设计 利用二叉树存储表达式，并求值，返回-Curriculum design using the binary tree data structure stored in the expression and evaluation, return
Pre-order-binary-tree-traversal
- 二叉树的前序遍历：主要运用C语言来实现二叉树的前序遍历算法-Pre-order binary tree traversal
binary-tree-algorithm
- C经典程序_二叉树算法集，希望对初学者有用-Classic binary tree algorithm C program _ set, hope useful for beginners
Binary-Tree-Sort
- 二叉树排序，二叉树的递归调用排序，属于C语言源码-Binary Tree Sort
First-order-binary-tree-traversal
- 二叉树先序遍历，二叉树先序遍历树种的各节点-First order binary tree traversal, preorder traversal of binary tree each node of tree species
Binary-Tree-Sort
- 二叉树排序~~~数据结构中要求掌握二叉树的排序-Binary sort ~ ~ ~ binary tree data structure required to master the sort ~~~~~~~
Balanced-binary-tree
- 基于C的平衡二叉树的建立及其测试，是学习平衡二叉树时不错的案例-build and test the balanced binary tree，is a good time to learn the case of balanced binary tree，based on c
binary-tree
- 基于C的线索二叉树的建立、遍历的测试，是学习数据结构不错的案例-Clues to the establishment of a binary tree, traversal of the test, the data structure is a good case study，based on C.
binary-tree-algorithm
- 二叉树算法实例 讲述基本的二叉树算法 计算机专业数据结构-二叉树算法讲解-Binary tree binary tree algorithm instance about basic computer science algorithms data structures- binary tree algorithm to explain
Balance-binary-tree
- 主要讲述平衡二叉树，以及linux内核的二叉树的红黑平衡二叉树的应用-Balance binary tree
Sort-binary-tree
- 排序二叉树完整程序代码，C++实现，编译测试通过-Sorting binary tree complete program code, c + + realization, compiled by test
binary-tree
- 一个完整的二叉树运行程序，调试过无任何问题-A complete binary tree is running the program, had no problems debugging
binary-tree
- 二叉树算法 分别用前序、中序、后序遍历二叉树。-Binary tree algorithms were used to pre-order, in order, the order of traversal binary tree.
Binary-tree
- 用C语言实验数据结构中的二叉树的建立，先序排列，及统计叶子节点数-Experiments with the C language data structures in the establishment of a binary tree, the first order arrangement, leaf nodes and statistics
Binary-tree
- 创建二叉树，先序中序后序递归二叉树，求叶子数目，求树高，左右子树交换。-Create a binary tree, in order of first-order recursive post-order binary tree, find the number of leaves, tree height requirements, exchange of left and right subtrees.
rebuild-the-binary-tree
- 二叉树重建 scily1935 根据二叉树的前序遍历和中序遍历的节点序列,输出二叉树的层序遍历的节点序列-rebulit the binary tree
Binary-tree
- 建立二叉树存储结构,求二叉树的前序中序后序遍历,以及求指定节点的路径-The establishment of binary storage structure, seeking pre-order binary tree traversal in order after the order, and find the path specified node
Binary-tree-sort
- 实现二叉树的前序、中序、后序排列，以菜单形式出现-To achieve the first order binary tree, in order, after the sequence order, in the form of a menu